A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning
نویسندگان
چکیده
Greedy best-first search (GBFS) is a popular and effective algorithm in satisficing planning and is incorporated into high-performance planners. GBFS in planning decides its search direction with automatically generated heuristic functions. However, if the heuristic functions evaluate nodes inaccurately, GBFS may be misled into a valueless search direction, thus resulting in performance degradation. This paper presents a simple but effective algorithm considering a diversity of search directions to avoid the errors of heuristic information. Experimental results in solving a variety of planning problems show that our approach is successful.
منابع مشابه
Diverse Depth-First Search in Satisificing Planning
In satisficing planning where suboptimal plans are accepted, many planners use greedy best-first search (GBFS). Despite recent advances in automatic heuristic function generation, GBFS often suffers from performance degradation caused by inaccurate state evaluations. Diverse best-first search (DBFS) (Imai and Kishimoto 2011) avoids plateaus of search due to such inaccuracies by occasionally sel...
متن کاملAn Algorithm for Avoiding Plateaus in Heuristic Search
In action planning, greedy best-first search (GBFS) is one of the standard techniques if suboptimal plans are accepted. GBFS uses a heuristic function to guide the search towards a goal state. To achieve generality, in domain-independant planning the heuristic function is generated automatically. A well-known problem of GBFS are search plateaus, i. e., regions in the search space where all stat...
متن کاملUnderstanding and Improving Local Exploration for GBFS
Greedy Best First Search (GBFS) is a powerful algorithm at the heart of many state-of-the-art satisficing planners. The Greedy Best First Search with Local Search (GBFS-LS) algorithm adds exploration using a local GBFS to a global GBFS. This substantially improves performance for domains that contain large uninformative heuristic regions (UHR), such as plateaus or local minima. This paper analy...
متن کاملExploration among and within Plateaus in Greedy Best-First Search
Recent enhancements to greedy best-first search (GBFS) such as DBFS, -GBFS, Type-GBFS improve performance by occasionally adopting a non-greedy node expansion policy, resulting in more exploratory behavior. However, previous exploratory mechanisms do not address exploration within the space sharing the same heuristic estimate (plateau). In this paper, we show these two modes of exploration, whi...
متن کاملAdding Local Exploration to Greedy Best-First Search in Satisficing Planning
Greedy Best-First Search (GBFS) is a powerful algorithm at the heart of many state of the art satisficing planners. One major weakness of GBFS is its behavior in so-called uninformative heuristic regions (UHRs) parts of the search space in which no heuristic provides guidance towards states with improved heuristic values. This work analyzes the problem of UHRs in planning in detail, and propose...
متن کامل